Convex polynomial approximation
نویسندگان
چکیده
Estimating the degree of approximation in the uniform norm, of a convex function on a finite interval, by convex algebraic polynomials, has received wide attention over the last twenty years. However, while much progress has been made especially in recent years by, among others, the authors of this article, separately and jointly, there have been left some interesting open questions. In this paper we give final answers to all those open problems. We are able to say, for each rth differentiable convex function, whether or not its degree of convex polynomial approximation in the uniform norm may be estimated by a Jackson-type estimate involving the weighted Ditzian-Totik kth modulus of smoothness, and how the constants in this estimate behave. It turns out that for some pairs (k, r) we have such estimate with constants depending only on these parameters; for other pairs the estimate is valid, but only with constants that depend on the function being approximated; while there are pairs for which the Jackson-type estimate is, in general, invalid.
منابع مشابه
Inhomogeneous polynomial optimization over a convex set: An approximation approach
In this paper, we consider computational methods for optimizing a multivariate inhomogeneous polynomial function over a general convex set. The focus is on the design and analysis of polynomial-time approximation algorithms. The methods are able to deal with optimization models with polynomial objective functions in any fixed degrees. In particular, we first study the problem of maximizing an i...
متن کاملSOME ESTIMATES FOR CONVEX POLYNOMIAL APPROXIMATION IN Lp
We prove a direct theorem for convex polynomial L p-approximation, 0 < p < 1, in terms of the classical modulus of smoothness ! 3 (f; t) p. This theorem may be regarded as an extension to L p of the well-known pointwise estimates of the Timan type and their variants of R. DeVore, Y. K. Hu and D. Leviatan for convex approximation in L p. It leads to a characterization of convex functions in Lips...
متن کاملApproximation of Univariate Set-Valued Functions- an Overview
The paper is an updated survey of our work on the approximation of univariate setvalued functions by samples-based linear approximation operators, beyond the results reported in our previous overview. Our approach is to adapt operators for real-valued functions to set-valued functions, by replacing operations between numbers by operations between sets. For set-valued functions with compact conv...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملShape - Preserving Multivariate Polynomial Approximation in C [ − 1 , 1 ]
where C > 0 is independent of f , n1, and n2, satisfying, moreover, the following shapepreserving properties: (i) if f is convex of order (0,0), then so is Pn1,n1(f ); (ii) if f is simultaneously convex of orders (−1,0), (0,−1), and (0,0) (i.e., totally upper monotone), then so is Pn1,n2(f ); (iii) if f is convex of order (1,1), then so is Pn1,n2(f ); (iv) if f is simultaneously convex of order...
متن کاملConvex Polynomial and Spline Approximation in Lp , 0 < p <
We prove that a convex function f 6 L p [ -1 , 1], 0 < p < cx~, can be approximated by convex polynomials with an error not exceeding Cw~ (f, 1/n)p where w~(f, .) is the Ditzian-Totik modulus of smoothness of order three of f . We are thus filling the gap between previously known estimates involving og~(f, I/n)p, and the impossibility of having such estimates involving ~o4. We also give similar...
متن کامل